A class of algorithms that repeatedly try all possible combinations until a solution is found.

A cryptanalysis technique or other kind of attack method involving an exhaustive procedure that tries all possibilities, one-by-one.

adj. Describes a primitive programming style, one in which the programmer relies on the computer's processing power instead of using his or her own intelligence to simplify the problem, often ign [..]

Internet Glossary Refers to a programming style that does not include any shortcuts to improve performance, but instead relies on sheer computing power to try all possibilities until the solution to a problem is found. A classic example is the traveling salesman problem (TSP). Suppose a salesman needs to visit 10 cities across the country. How does [..]

Refers to a programming style that does not include any shortcuts to improve performance, but instead relies on sheer computing power to try all possibilities until the solution to a problem is found. [..]

n. a problem-solving approach in which the strategy is to relentlessly look for all possible solutions to the problem - that is, until all means have been exhausted and tested, usually on a computer. [..]

Used in problem solving where evry possible solution is generated and tested. See algorithm- exhaustive search

A classic attack technique whereby all possible combinations are attempted until one succeeds. This typically refers to cryptography, either finding the right key to decrypt a message, or discoverin [..]

An automated process of trial and error used to guess the “secret” protecting a system. Examples of these secrets include usernames, passwords or cryptographic keys. See also “Authentication”, “Insuff [..]

Using a program to bombard a site with scripted input or page requests in order to 'solve' a form-based puzzle or discover hidden directories or pages.